A heuristic for decomposition in multilevel logic optimization
نویسندگان
چکیده
منابع مشابه
A Heuristic for Decomposition in Multi-Level Logic Optimization
In this paper, we propose a new heuristic to find common subexpressions of given Boolean functions based on Shannon-type factoring. This heuristic limits the search space of finding common subexpressions considerably by applying a top-down approach. In this top-down approach, synthesis of a Boolean network flows from the primary outputs to the primary inputs. The common subexpressions and their...
متن کاملLayout-based Logic Decomposition for Timing Optimization
As feature sizes shrink to deep sub-micron, the performance of VLSI chips becomes dominated by the interconnect delay. In a traditional top-down design ow, logic synthesis algorithms optimize gate area or delay without accurate interconnect delay because of lack of physical design information. Thus, the e ectiveness of the optimization techniques is limited. We integrate logic synthesis and phy...
متن کاملA Decomposition Heuristic for ResourceAllocationBerthe
Allocation Berthe Y. Choueiry1 and Boi Faltings2 Abstract. The allocation of resources to a set of tasks with xed start and end times is known to be NP-complete. We propose an approximation based on identifying pools of interchangeable resources and tasks using a novel decomposition heuristic. The pools are abstractions which provide simple representations for making con icts explicit. The meth...
متن کاملA Heuristic Approach for Optimization of Gearbox Dimension
A powerful optimization method is proposed in this study for the minimal dimensional design problem of gearbox. It is a general model that is suitable to use for any series of gear drives system and can extract both dimensional and layout of components-limited optimization design together. The objective function in this study has many local extremes so for avoiding this situation, various const...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 1993
ISSN: 1063-8210,1557-9999
DOI: 10.1109/92.250191